package leetcode_2501_2600;

import java.util.HashSet;
import java.util.Set;

public class LeeCode_2586 {
    public static void main(String[] args) {

    }
    private static int vowelStrings(String[] words, int left, int right) {
        Set<Character> set = new HashSet<>();
        set.add('a');
        set.add('e');
        set.add('i');
        set.add('o');
        set.add('u');
        int ans = 0;
        for (int i = left; i <= right; i++) {
            String word = words[i];
            if (set.contains(word.charAt(0)) && set.contains(word.charAt(word.length() - 1))){
                ans++;
            }
        }
        return ans;
    }
}
